A note on the extension complexity of the knapsack polytope

نویسندگان

Sebastian Pokutta

Mathieu Van Vyve

چکیده

We show that there are 0-1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each n ∈ N we exhibit 0-1 and unbounded knapsack polyhedra in dimension n with extension complexity Ω(2 p n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

M by addressing probabilistic 0–1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can be extended with a single variable is NP-hard. We describe and compare a number of exact and heuristic sepa...

متن کامل

An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes

Given an n-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio (n/ logn). There is a substantial progress on randomized approximation such as Markov chain Monte Carlo for a highdimensional volume, and for many #P-hard problems, while some deterministic approximation algorithms are rece...

متن کامل

On the 0/1 knapsack polytope

Given a set N of items and a capacity b 2 IN, and let N j be the set of items with weight j, 1 j b. The 0/1 knapsack polytope is the convex hull of all 0/1 vectors that satisfy the inequality b X j=1 X i2N j jx i b: In this paper we rst present a complete linear description of the 0/1 knapsack polytope for two special cases: (a) N j = ; for all 1 < j b b 2 c and (b) N j = ; for all 1 < j b b 3 ...

متن کامل

The submodular knapsack polytope

The submodular knapsack set is the discrete lower level set of a submodular function. The modular case reduces to the classical linear 0-1 knapsack set. One motivation for studying the submodular knapsack polytope is to address 0-1 programming problems with uncertain coefficients. Under various assumptions, a probabilistic constraint on 0-1 variables can be modeled as a submodular knapsack set....

متن کامل